منابع مشابه
Non-Orthomodular Models for Both Standard Quantum Logic and Standard Classical Logic: Repercussions for Quantum Computers
It is shown that propositional calculuses of both quantum and classical logics are noncategorical. We find that quantum logic is in addition to an orthomodular lattice also modeled by a weakly orthomodular lattice and that classical logic is in addition to a Boolean algebra also modeled by a weakly distributive lattice. Both new models turn out to be non-orthomodular. We prove the soundness and...
متن کاملNon-deterministic Semantics for Dynamic Topological Logic
Dynamic Topological Logic (DT L) is a combination of S4, under its topological interpretation, and the temporal logic LT L interpreted over the natural numbers. DT L is used to reason about properties of dynamical systems based on topological spaces. Semantics are given by dynamic topological models, which are tuples 〈X, T , f, V 〉, where 〈X, T 〉 is a topological space, f a function on X and V ...
متن کاملNon-deterministic semantics for dynamic topological logic
Dynamic Topological Logic (DT L) is a combination of S4, under its topological interpretation, and the temporal logic LT L interpreted over the natural numbers. DT L is used to reason about properties of dynamical systems based on topological spaces. Semantics are given by dynamic topological models, which are tuples 〈X, T , f, V 〉, where 〈X, T 〉 is a topological space, f a function on X and V ...
متن کاملAlgebraic Approach to Algorithmic Logic
We introduce algorithmic logic – an algebraic approach according to [25]. It is done in three stages: propositional calculus, quantifier calculus with equality, and finally proper algorithmic logic. For each stage appropriate signature and theory are defined. Propositional calculus and quantifier calculus with equality are explored according to [24]. A language is introduced with language signa...
متن کاملAlgorithmic correspondence and completeness in modal logic
This thesis takes an algorithmic perspective on the correspondence between modal and hybrid logics on the one hand, and first-order logic on the other. The canonicity of formulae, and by implication the completeness of logics, is simultaneously treated. Modal formulae define second-order conditions on frames which, in some cases, are equivalently reducible to first-order conditions. Modal formu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1986
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(86)80013-x